974 research outputs found

    On n-sum of an abelian group of order n

    Full text link
    Let GG be an additive finite abelian group of order nn, and let SS be a sequence of n+kn+k elements in GG, where k1k\geq 1. Suppose that SS contains tt distinct elements. Let n(S)\sum_n(S) denote the set that consists of all elements in GG which can be expressed as the sum over a subsequence of length nn. In this paper we prove that, either 0n(S)0\in \sum_n(S) or n(S)k+t1.|\sum_n(S)|\geq k+t-1. This confirms a conjecture by Y.O. Hamidoune in 2000

    A Novel Multiplex Network-based Sensor Information Fusion Model and Its Application to Industrial Multiphase Flow System

    Get PDF
    This work was supported by National Natural Science Foundation of China under Grant No. 61473203, and the Natural Science Foundation of Tianjin, China under Grant No. 16JCYBJC18200.Peer reviewedPostprin
    corecore